On Arithmetic Progressions of Integers with a Distinct Sum of Digits
نویسنده
چکیده
Let b ≥ 2 be a fixed integer. Let sb(n) denote the sum of digits of the nonnegative integer n in the base-b representation. Further let q be a positive integer. In this paper we study the length k of arithmetic progressions n, n+ q, . . . , n+ q(k − 1) such that sb(n), sb(n+ q), . . . , sb(n+ q(k − 1)) are (pairwise) distinct. More specifically, let Lb,q denote the supremum of k as n varies in the set of nonnegative integers N. We show that Lb,q is bounded from above and hence finite. Then it makes sense to define μb,q as the smallest n ∈ N such that one can take k = Lb,q. We provide upper and lower bounds for μb,q. Furthermore, we derive explicit formulas for Lb,1 and μb,1. Lastly, we give a constructive proof that Lb,q is unbounded with respect to q.
منابع مشابه
On rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
متن کاملForbidden arithmetic progressions in permutations of subsets of the integers
Permutations of the positive integers avoiding arithmetic progressions of length 5 were constructed in (Davis et al, 1977), implying the existence of permutations of the integers avoiding arithmetic progressions of length 7. We construct a permutation of the integers avoiding arithmetic progressions of length 6. We also prove a lower bound of 1 2 on the lower density of subsets of positive inte...
متن کاملOn the Union of Arithmetic Progressions
We show that for every > 0 there is an absolute constant c( ) > 0 such that the following is true: The union of any n arithmetic progressions, each of length n, with pairwise distinct differences must consist of at least c( )n2− elements. We show also that this type of bound is essentially best possible, as we can find n arithmetic progressions, each of length n, with pairwise distinct differen...
متن کاملOn a generalisation of Roth’s theorem for arithmetic progressions and applications to sum-free subsets
We prove a generalisation of Roth’s theorem for arithmetic progressions to d-configurations, which are sets of the form {ni+nj +a}1≤i≤j≤d with a, n1, ..., nd ∈ N, using Roth’s original density increment strategy and Gowers uniformity norms. Then we use this generalisation to improve a result of Sudakov, Szemerédi and Vu about sum-free subsets [10] and prove that any set of n integers contains a...
متن کاملPrimes in arithmetic progression
Prime numbers have fascinated people since ancient times. Since the last century, their study has acquired importance also on account of the crucial role played by them in cryptography and other related areas. One of the problems about primes which has intrigued mathematicians is whether it is possible to have long strings of primes with the successive primes differing by a fixed number, namely...
متن کامل